The Multi-class Fifo M/g/1 Queue with Exponential Working Vacations

نویسندگان

  • Yoshiaki Inoue
  • Tetsuya Takine
چکیده

We consider a stationary multi-class FIFO M/G/1 queue with exponential working vacations, where a server works at two different processing rates. There are K classes of customers, and the arrival rates and the distributions of the amount of service requirements of arriving customers depend on both their customer classes and the server state. When the system becomes empty, the server takes a working vacation, during which customers are served at processing rate γ (γ > 0). If the system is empty at the end of the working vacation, the server takes another working vacation. On the other hand, if a customer is being served at the end of the working vacation, the server switches its processing rate to one and continues to serve customers in a preemptive-resume manner, until the system becomes empty. For this queue, we derive various quantities of interest, including the Laplace-Stieltjes transforms of the actual waiting time and sojourn time distributions, and the joint transform of the numbers of customers and the amounts of unfinished work in respective classes. As by-products, we also obtain various results of a stationary multi-class FIFO M/G/1 queue with Poisson disasters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

Transient Solution of an M/M/1 Variant Working Vacation Queue with Balking

This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...

متن کامل

Bat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

متن کامل

M/M/1 retrial queue with working vacations and negative customer arrivals

The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exp...

متن کامل

Mathematical Modelling and Performance Analysis of Single Server Two-State Batch Arrivals and Batch Service Markovian Queue with Multiple Vacations

Abstract Here a two-state batch arrivals and batch service Markovian queue with server vacation model has been taken into consideration for its mathematical modelling and performance analysis under transient state. The present Markovian queueing model considers a single server with multiple vacations and both arrivals and services in batches of variable size. Arriving customers are processed by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013